Nonlinear bipartite matching
نویسندگان
چکیده
منابع مشابه
Nonlinear Bipartite Matching
We study the problem of optimizing nonlinear objective functions over bipartite matchings. While the problem is generally intractable, we provide several efficient algorithms for it, including a deterministic algorithm for maximizing convex objectives, approximative algorithms for norm minimization and maximization, and a randomized algorithm for optimizing arbitrary objectives.
متن کاملBipartite matching extendable graphs
Matching extendability is significant in graph theory and its applications. The basic notion in this direction is n-extendability introduced by Plummer in 1980. Motivated by the different natures of bipartite matchings and non-bipartite matchings, this paper investigates bipartite-matching extendable (BM-extendable) graphs. A graph G is said to be BM-extendable if every matching M which is a pe...
متن کاملOnline Bipartite Matching
We present a few important results on online bipartite matching problem. The input to the problem is a bipartite graph G = (U, V,E), in which vertices in U arrive in on-line fashion. As each vertex u from U arrives, the edges incident on it are revealed. We need to match u to one of the previously unmatched vertices in V . If no such vertex in V exists, then u remains unmatched. The choice of a...
متن کاملBiobjective Online Bipartite Matching
Motivated by Online Ad allocation when there are multiple conflicting objectives, we introduce and study the problem of Biobjective Online Bipartite Matching, a strict generalization of the standard setting of Karp, Vazirani and Vazirani [9], where we are allowed to have edges of two colors, and the goal is to find a matching that is both large and balanced at the same time. We study both deter...
متن کاملDiverse Weighted Bipartite b-Matching
Bipartite matching, where agents on one side of a market are matched to agents or items on the other, is a classical problem in computer science and economics, with widespread application in healthcare, education, advertising, and general resource allocation. A practitioner’s goal is typically to maximize a matching market’s economic efficiency, possibly subject to some fairness requirements th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2008
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.11.002